Applying Gene Expression Programming for Solving One-Dimensional Bin-Packing Problems

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Solving Balancing and Bin-Packing problems with Constraint Programming

This work could not have been achieved without the support of the following persons. My parents who encourage me to finish this thesis (even by coming in Providence). They are great example for their five children. My wife Caro who supports me everyday. She's always there to remind me what is the most important in my life and helps me to find a good balance between work, family and friends. Yve...

متن کامل

Variants of Classical One-Dimensional Bin Packing

Joseph Y.-T. Leung New Jersey Institute of Technology 33.

متن کامل

A unified hyper-heuristic framework for solving bin packing problems

One-and two-dimensional packing and cutting problems occur in many commercial contexts, and it is often important to be able to get good-quality solutions quickly. Fairly simple deterministic heuristics are often used for this purpose, but such heuristics typically find excellent solutions for some problems and only mediocre ones for others. Trying several different heuristics on a problem adds...

متن کامل

Using Decomposition Techniques and Constraint Programming for Solving the Two-Dimensional Bin-Packing Problem

T two-dimensional bin-packing problem is the problem of orthogonally packing a given set of rectangles into a minimum number of two-dimensional rectangular bins. The problem is -hard and very difficult to solve in practice as no good mixed integer programming (MIP) formulation has been found for the packing problem. We propose an algorithm based on the well-known Dantzig-Wolfe decomposition whe...

متن کامل

Two-dimensional bin packing with one-dimensional resource augmentation

The 2-dimensional Bin Packing problem is a generalization of the classical Bin Packing problems and is defined as follows: Given a collection of rectangles specified by their width and height, the goal is to pack these into minimum number of square bins of unit size. Recently, the problem was proved to be APX-hard even in the asymptotic case, i.e. when the optimum solutions requires a large num...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: AL-Rafidain Journal of Computer Sciences and Mathematics

سال: 2013

ISSN: 2311-7990

DOI: 10.33899/csmj.2013.163549